Local Testing and Decoding of High-Rate Error-Correcting Codes∗
نویسندگان
چکیده
We survey the state of the art in constructions of locally testable codes, locally decodable codes and locally correctable codes of high rate.
منابع مشابه
List Decoding and Property Testing of Error Correcting Codes
List Decoding and Property Testing of Error Correcting Codes Atri Rudra Chair of the Supervisory Committee: Associate Professor Venkatesan Guruswami Department of Computer Science and Engineering Error correcting codes systematically introduce redundancy into data so that the original information can be recovered when parts of the redundant data are corrupted. Error correcting codes are used ub...
متن کاملUnified Error Probability Analysis for Error Correcting Codes with Different Decoding Algorithms
The error rate of error correcting codes with soft-decision-decoding rarely has a closed-form expression. Bounding techniques are widely used to evaluate the performance of maximum-likelihood decoding algorithm. But the existing bounds are not tight enough especially for a low signal-to-noise ratios region and become looser when a suboptimum decoding algorithm is used. The radius of decision re...
متن کاملDecoding interleaved Reed-Solomon codes beyond their joint error-correcting capability
A new probabilistic decoding algorithm for low-rate Interleaved Reed– Solomon (IRS) codes is presented. This approach increases the error correcting capability of IRS codes compared to other known approaches (e.g. joint decoding) with high probability. It is a generalization of well-known decoding approaches and its complexity is quadratic with the length of the code. Asymptotic parameters of t...
متن کاملSearch Based Weighted Multi-Bit Flipping Algorithm for High-Performance Low-Complexity Decoding of LDPC Codes
In this paper, two new hybrid algorithms are proposed for decoding Low Density Parity Check (LDPC) codes. Original version of the proposed algorithms named Search Based Weighted Multi Bit Flipping (SWMBF). The main idea of these algorithms is flipping variable multi bits in each iteration, change in which leads to the syndrome vector with least hamming weight. To achieve this, the proposed algo...
متن کاملImproved Code Construction for Synchronization Error Correction
Minimum distance (MD), maximum likelihood (ML), and maximum a posteriori (MAP) decoding is considered for synchronization error correcting (SEC) codes with known codeword boundaries when transmitted over the Binary Substitution, Insertion and Deletion channel. It is shown that MD decoding is sub-optimal, unlike ML or MAP decoding. Based on ML and MAP decoding, a new measure called the Change Pr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2017